Simple upper bound for the power partition function
Wladimir Pribitkin (College of Staten Island and CUNY Graduate Center)
| Wed Jul 15, 19:00-19:25 (5 days from now) | |
| Lecture held in Science Center in the CUNY Graduate Center (4th floor). |
Abstract: Reimagining Siegel's method, we shall produce a rather easy proof of a surprisingly good upper bound on the number of partitions of a positive integer into perfect $r$th powers, where $r \ge 1$. If time permits, we shall present a generalization pertaining to partitions into perfect powers of terms in an arithmetic progression.
number theory
Audience: researchers in the topic
Combinatorial and additive number theory seminar (CANT 2026)
| Organizer: | Mel Nathanson* |
| *contact for this listing |
Export talk to